package algorithm.leetcode.simple;

/*
 罗马数字包含以下七种字符： I， V， X， L，C，D 和 M。
 */

/**
 * @author jack.wu
 * @version 1.0
 * @date 2020/8/18
 */
public class Question12 {
    public static void main(String[] args) {

        Question12 question = new Question12();
        String roman = question.intToRoman(123);
        System.out.println(roman);
    }

    public String intToRoman(int num) {
        int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        String[] symbols = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < values.length && num >= 0; i++) {
            while (values[i] <= num) {
                num -= values[i];
                sb.append(symbols[i]);
            }
        }
        return sb.toString();
    }
}
